p-Rook Numbers and Cycle Counting in Cp ≀ Sn

نویسندگان

  • James Haglund
  • Jeffrey Remmel
  • Meesue Yoo
چکیده

Cycle-counting rook numbers were introduced by Chung and Graham [7]. Cycle-counting q-rook numbers were introduced by Ehrenborg, Haglund, and Readdy [9] and cycle-counting q-hit numbers were introduced by Haglund [14]. Briggs and Remmel [4] introduced the theory of p-rook and p-hit numbers which is a rook theory model where the rook numbers correspond to partial permutations in Cp ≀ Sn, the wreath product of the cyclic group Cp and the symmetric group Sn, and the hit numbers correspond to signed permutations in Cp ≀ Sn. In this paper, we extend the cycle-counting q-rook numbers and cycle-counting q-hit numbers to the Briggs-Remmel model. In such a setting, we define a multivariable version of the cycle-counting q-rook numbers and cycle-counting q-hit numbers where we keep track of cycles of permutations and partial permutations of Cp ≀ Sn according to the signs of the cycles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

p-Rook Numbers and Cycle Counting in Cp o Sn

Cycle-counting rook numbers were introduced by Chung and Graham [8]. Cycle-counting q-rook numbers were introduced by Ehrenborg, Haglund, and Readdy [10] and cycle-counting q-hit numbers were introduced by Haglund [14]. Briggs and Remmel [5] introduced the theory of p-rook and p-hit numbers which is a rook theory model where the rook numbers correspond to partial permutations in Cp oSn, the wre...

متن کامل

Cycles and perfect matchings

Fan Chung and Ron Graham (J. Combin. Theory Ser. B 65 (1995), 273-290) introduced the cover polynomial for a directed graph and showed that it was connected with classical rook theory. M. Dworkin (J. Combin. Theory Ser. B 71 (1997), 17-53) showed that the cover polynomial naturally factors for directed graphs associated with Ferrers boards. The authors (Adv. Appl. Math. 27 (2001), 438-481) deve...

متن کامل

A p, q-analogue of a Formula of Frobenius

Garsia and Remmel (JCT. A 41 (1986), 246-275) used rook configurations to give a combinatorial interpretation to the q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to the Eulerian polynomials. Later, Remmel and Wachs defined generalized p, q-Stirling numbers of the first and second kind in terms of rook placements. Additionally, they extended their definit...

متن کامل

Elliptic Rook and File Numbers

Utilizing elliptic weights, we construct an elliptic analogue of rook numbers for Ferrers boards. Our elliptic rook numbers generalize Garsia and Remmel’s q-rook numbers by two additional independent parameters a and b, and a nome p. The elliptic rook numbers are shown to satisfy an elliptic extension of a factorization theorem which in the classical case was established by Goldman, Joichi and ...

متن کامل

The rook partition algebra

The rook partition algebra RPk(x) is a semisimple algebra for all but a finite number of values of x ∈ C that arises from looking at what commutes with the action of the symmetric group Sn on U ⊗k, where U is the direct sum of the natural representation and the trivial representation of Sn. We give a combinatorial description of this algebra, construct its irreducible representations, and exhib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010